Exceptional Words Counting
نویسنده
چکیده
منابع مشابه
Analysis of single-strand exceptional word symmetry in the human genome: new measures.
Some previous studies suggest the extension of Chargaff's second rule (the phenomenon of symmetry in a single DNA strand) to long DNA words. However, in random sequences generated under an independent symbol model where complementary nucleotides have equal occurrence probabilities, we expect the phenomenon of symmetry to hold for any word length. In this work, we develop new statistical methods...
متن کاملCounting Exceptional Instantons
We show how to obtain the instanton partition function of N = 2 SYM with exceptional gauge group EFG using blow-up recursion relations derived by Nakajima and Yoshioka. We compute the two instanton contribution and match it with the recent proposal for the superconformal index of rank 2 SCFTs with E6,7 global symmetry. [email protected] [email protected]
متن کاملGlobally, unrelated protein sequences appear random
MOTIVATION To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared the frequencies of four- and five-amino acid word clumps (independent words) in proteins to the frequencies predicted by four random sequence models. RESULTS While the human proteome has many overrepresented word clumps...
متن کاملOn Counting Sequences and Some Research Questions
A counting sequence is a list of all binary words of the same length. Counting sequences of any fixed odd Hamming distance between successive words (codewords) are discussed. Gray codes are examples of counting sequences having a single-bit change between neighboring codewords. We describe some results on Gray codes and highlight some research questions. The spectrum of bit changes or transitio...
متن کاملCombinatorial Algorithms for Approximate Words
The search and the analysis of motifs on the genome and the proteome is a very active domain in computational biology. The so-called formal approaches search for exceptional words on an entire genome, or some part of it. The specificity of our algorithmic approach is the combination of recent results in probability and combinatorics with highlevel pattern matching algorithms. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008